On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be?
نویسندگان
چکیده
We study convergence properties of iterative voting procedures. Such a procedure is defined by a voting rule and a (restricted) iterative process, where at each step one agent can modify his vote towards a better outcome for himself. It has already been observed in previous works that if voters are allowed to make arbitrary moves (or even only best responses), such processes may not converge for most common voting rules. It is therefore important to investigate whether and which natural restrictions on the dynamics of iterative voting procedures can guarantee convergence. To this end, we provide two general conditions on dynamics based on iterative myopic improvements, each of which is sufficient for convergence. We then identify several classes of voting rules, along with their corresponding iterative processes, for which at least one of these conditions hold. Our work generalizes recent results and relaxes a number of restrictive assumptions made in previous research.
منابع مشابه
Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency
In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made computationally difficult for the agents to perform. However, there are scenarios in which a restricted form of manipulation can instead be beneficial. In this paper we c...
متن کاملRestricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score
In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made computationally difficult for the agents to perform. However, there are scenarios in which a restricted form of manipulation can instead be beneficial. In this paper we c...
متن کاملConvergence of iterative voting
In multiagent systems, social choice functions can help aggregate the distinct preferences that agents have over alternatives, enabling them to settle on a single choice. Despite the basic manipulability of all reasonable voting systems, it would still be desirable to find ways to reach a stable result, i.e., a situation where no agent would wish to change its vote. One possibility is an iterat...
متن کاملConvergence of an Iterative Scheme for Multifunctions on Fuzzy Metric Spaces
Recently, Reich and Zaslavski have studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In 2011, Aleomraninejad, et. al. generalized some of their results to Suzuki-type multifunctions. The study of iterative schemes for various classes of contractive and nonexpansive mappings is a central topic in fixed point theory. The importance of Banach ...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کامل